Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
نویسندگان
چکیده
منابع مشابه
Fast Enclosure for Solutions of Generalized Least Squares Problems∗
Fast algorithms for enclosing solutions of generalized least squares problems are proposed. To develop these algorithms, theories for obtaining error bounds on numerical solutions are established. The error bounds obtained by these algorithms are “verified” in the sense that all the possible rounding errors have been taken into account. A technique for obtaining smaller error bounds is introduc...
متن کاملNew Fast Algorithms for Structured Linear Least Squares Problems
We present new fast algorithms for solving the Toeplitz and the Toeplitz-plus-Hankel least squares problems. These algorithms are based on a new fast algorithm for solving the Cauchy-like least squares problem. We perform an error analysis and provide conditions under which these algorithms are numerically stable. We also develop implementation techniques that signiicantly reduce the execution ...
متن کاملLinear Least Squares Problems
A fundamental task in scientific computing is to estimate parameters in a mathematical model from collected data which are subject to errors. The influence of the errors can be reduced by using a greater number of data than the number of unknowns. If the model is linear, the resulting problem is then to “solve” an in general inconsistent linear system Ax = b, where A ∈ Rm×n and m ≥ n. In other ...
متن کاملA numerically stable fast Newton type adaptive filter based on order update fast least squares algorithm
The numerical property of an adaptive filter algorithm is the most important problem in practical applications. Most fast adaptive filter algorithms have the numerical instability problem and the fast Newton transversal filter (FNTF) algorithms are no exception. In this paper, we propose a numerically stable fast Newton type adaptive filter algorithm. Two problems are dealt with in the paper. F...
متن کاملNumerical methods for generalized least squares problems
Usually generalized least squares problems are solved by transforming them into regular least squares problems which can then be solved by well-known numerical methods. However, this approach is not very effective in some cases and, besides, is very expensive for large scale problems. In 1979, Paige suggested another approach which consists of solving an equivalent equality-constrained least sq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1979
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0716012